منابع مشابه
two-out degree equitable domination in graphs
an equitable domination has interesting application in the contextof social networks. in a network, nodes with nearly equal capacitymay interact with each other in a better way. in the societypersons with nearly equal status, tend to be friendly. in thispaper, we introduce new variant of equitable domination of agraph. basic properties and some interesting results have beenobtained.
متن کاملHyper Domination in Bipartite Semigraphs
Let S be a bipartite semigraph with |NXa(y)| ≥ 1 for every y ∈ Y . A vertex x ∈ X hyper dominates y ∈ Y if y ∈ Na(x) or y ∈ Na(NY a(x)). A subsetD ⊆ X is a hyper dominating set of S if every y ∈ Y is hyper dominated by a vertex ofD. A subsetD ⊆ X is called a minimal hyper dominating set of S if no proper subset of D is a hyper dominating set of S. The minimum cardinality of a minimal hyper domi...
متن کاملEquitable Edge Domination in Graphs
A subset D of V (G) is called an equitable dominating set of a graph G if for every v ∈ (V − D), there exists a vertex u ∈ D such that uv ∈ E(G) and |deg(u) − deg(v)| 6 1. The minimum cardinality of such a dominating set is denoted by γe(G) and is called equitable domination number of G. In this paper we introduce the equitable edge domination and equitable edge domatic number in a graph, exact...
متن کاملNeighborhood Connected Equitable Domination in Graphs
Let G = (V,E) be a connected graph, An equitable dominating S of a graph G is called the neighborhood connected equitable dominating set (nced-set) if the induced subgraph 〈Ne(S)〉 is connected The minimum cardinality of a nced-set of G is called the neighborhood connected equitable domination number of G and is denoted by γnce(G). In this paper we initiate a study of this parameter. For any gra...
متن کاملDomination in Degree Splitting Graphs
Let G = (V, E) be a graph with V = S1 S2 ...,St T where each Si is a set of vertices having at least two vertices and having the same degree and T = V Si. The degree splitting graph of G is denoted by DS(G) is obtained from G by adding vertices w1, w2, ..., wt and joining wi to each vertex of Si (1 i t). Let the vertices and the edges of a graph G are called the elements of G. In this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Mathematica
سال: 2017
ISSN: 2456-8686
DOI: 10.26524/cm14